Eigensharp graphs: decomposition into complete bipartite subgraphs
نویسندگان
چکیده
منابع مشابه
Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
Let r(G) be the minimum number of complete bipartite subgraphs needed to partition the edges of G, and let r'G) be the larger of the number of positive and number of negative eigenvalues of G. It is known that T{G) > r(G); graphs with t(G) = r(G) are called eigensharp. Eigensharp graphs include graphs, trees, cycles Cn with n = 4 or n ^ 4k, prisms Cn\2K2 with n ^ 3fc, "twisted prisms" (also cal...
متن کاملMixed cycle-E-super magic decomposition of complete bipartite graphs
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ΣνεV(H) f(v) + ΣeεE(H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥ ...
متن کاملMixed cycle-E-super magic decomposition of complete bipartite graphs
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ∑νεV (H) f(v) + ∑νεE (H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥...
متن کاملDecompositions of Complete Graphs into Bipartite 2-Regular Subgraphs
It is shown that if G is any bipartite 2-regular graph of order at most n2 or at least n − 2, then the obvious necessary conditions are sufficient for the existence of a decomposition of the complete graph of order n into a perfect matching and edge-disjoint copies of G.
متن کاملOn the cyclic decomposition of complete graphs into bipartite graphs
Let G be a graph with n edges. It is known that there exists a cyelic Gdecomposition of K 2n+1 if and only if G has a p-Iabeling. An a-labeling of G easily yields both a cyelic G-decomposition of Kn,n and of K2nx+l for all positive integers x. It is well-known that certain classes of bipartite graphs (including certain trees) do not have a-Iabelings. :Moreover, there are bipartite graphs with n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1988
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1988-0929670-5